Jump to content

Decidable sublanguages of set theory

From Wikipedia, the free encyclopedia

In mathematical logic, various sublanguages of set theory are decidable.[1][2] These include:

  • Sets with Monotone, Additive, and Multiplicative Functions.[3]
  • Sets with restricted quantifiers.[4]

References

[edit]